A Canonical Partition Theorem for Equivalence Relations on Zt
نویسندگان
چکیده
THEOREM A. For every positive integer m there exists a positive integer n such that for every coloring A: (O,..., n 1) + w there exists an arithmetic progression a, a + d,..., a + (m 1)d of length m such that the restriction of A to {a, a + d,..., a + (m l)d} is either a constant or a one-to-one mapping. This theorem is the so called canonical version of van der Waerden’s theorem on arithmetic progressions [7]. Originally, the consideration of canonical partition theorems goes back to Erdiis and Rado [2 1 who proved this generalization of Ransey’s theorem known as “Erd6s-Rado canonization theorem.”
منابع مشابه
A canonical partition theorem for trees
We show that for every positive integer d, every downwards closed subtree T of d without terminal nodes and every finite weakly embedded subtree A of T there is a finite list of equivalence relations on Em(T ) with the property that for every other equivalence relation E on Em(T ) there is a strongly embedded subtree S ⊆ T of height ω, such that E Em(S) is equal to one of the equivalence relati...
متن کاملON THE COMPATIBILITY OF A CRISP RELATION WITH A FUZZY EQUIVALENCE RELATION
In a recent paper, De Baets et al. have characterized the fuzzytolerance and fuzzy equivalence relations that a given strict order relation iscompatible with. In this paper, we generalize this characterization by consideringan arbitrary (crisp) relation instead of a strict order relation, while payingattention to the particular cases of a reflexive or irreflexive relation. The reasoninglargely ...
متن کاملCanonical Forms and Automorphisms in the Projective Space
Let C be a sequence of multisets of subspaces of a vector space Fq . We describe a practical algorithm which computes a canonical form and the stabilizer of C under the group action of the general semilinear group. It allows us to solve canonical form problems in coding theory, i.e. we are able to compute canonical forms of linear codes, Fq-linear block codes over the alphabet Fqs and random ne...
متن کاملA new proof of von Neumann's theorem concerning the uniqueness of the Schrödinger operators
We give a new proof of von Neumann's theorem, which states that the Schrödinger representation of the canonical commutation relations is (up to unitary equivalence) the only one, in the case of a finite number of canonical variables.
متن کاملIrreducibility on General Fuzzy Automata
The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 34 شماره
صفحات -
تاریخ انتشار 1983